A Cycle Search Algorithm for an LDPC Code Design
نویسندگان
چکیده
A message-passing based search algorithm for cycles in a Tanner graph is proposed for designing good lowdensity parity-check (LDPC) codes. By applying the message-passing algorithm with only two message alphabets to a cycle search, we can easily perform the cycle search for a good LDPC code with an existing message-passing decoder.
منابع مشابه
A Cycle Search Algorithm Based on a Message-Passing for the Design of Good LDPC Codes
A cycle search algorithm based on a message-passing in a Tanner graph is proposed for designing good LDPC codes. By applying the message-passing algorithm with a message alphabet composed of only two messages to a cycle search, we can perform a cycle search with less computational complexity than tree-based search algorithms. Also, the proposed algorithm can be easily implemented by using an ex...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملRate-Compatible LDPC Codes with Short Block Lengths Based on Puncturing and Extension Techniques
In this paper, we present novel strategies for generating rate-compatible (RC) irregular low-density parity-check (LDPC) codes with short/moderate block lengths. We propose three puncturing and two extension schemes, which are designed to determine the puncturing positions that minimize the performance degradation and the extension that maximizes the performance. The first puncturing scheme emp...
متن کاملConstruction of Irregular LDPC Code Using ACE Algorithm
The Low Density Parity Check (LDPC) codes have been widely acclaimed in recent years for their nearcapacity performance, they have not found their way into many important applications. For some cases, this is due to their increased decoding complexity relative to the classical coding techniques. For other cases, this is due to their inability to reach very low bit error rates at low signal-to-n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004